Irrelevant updates and self-maintainability in transitive closure database views
نویسندگان
چکیده
Irrelevant updates in a database are updates to source data that do not affect a view defined over the source data. Selfmaintainable updates are ones for which the view can be updated, without having to access source data, when the source data from which the view is derived is updated. In this paper we derive necessary and sufficient conditions for an update to be irrelevant or self-maintainable when the source data is a graph and the view is defined to be the transitive closure of the graph.
منابع مشابه
Irrelevant Updates and Self-maintainability in Transitive Closure Views
Irrelevant updates are updates to source data that do not aaect a view deened over the source data. Self-maintainable updates are ones for which the view can be updated, without having to access source data, when the source data from which the view is derived is updated. In this paper we derive necessary and suucient conditions for an update to be irrelevant or self-maintainable when the source...
متن کاملUsing Local Data in Detecting Irrelevant Updates and Self-Maintainability
The topics of data warehousing and materialized views have attracted in recent years considerable attention, both from industrial and research perspectives, because of their importance in providing support for sophisticated decision support analysis. In a data warehouse, the contents can be viewed as a set of views materialized from sources which are typically remote and heterogeneous. In order...
متن کاملMaintenance of Recursive Views
DEFINITION A view is a derived or virtual table that is typically defined by a query, providing an abstraction or an alternate perspective of the data that allows for more intuitive query specifications using these views. Each reference to the view name results in the retrieval of the view definition and the recomputation of the view to answer the query in which the view was referenced. When vi...
متن کاملThe Dynamic Complexity of Transitive Closure Is In DynTC0
This paper presents a fully dynamic algorithm for maintaining the transitive closure of a binary relation. All updates and queries can be computed by constant depth threshold circuits of polynomial size (TC circuits). This places dynamic transitive closure in the dynamic complexity class DynTC, and implies that transitive closure can be maintained in database systems that include first-order up...
متن کاملEecient Self-maintenance of Materialized Views
We address the problem of incrementallymaintaining a materialized view using the view instance and the update but with only limited access to the base data. We give necessary and su cient conditions for self-maintainability (handling updates without looking at all base data) for conjunctive-query (CQ) views. These conditions, which we call Complete Tests for Self-Maintainability or CTSM in shor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 89 شماره
صفحات -
تاریخ انتشار 2004